#include <iostream>
using namespace std;
int main()
{
  cout << 2025 - 1949 << endl;
  return 0;
}
#include <iostream>
#include <unordered_map>
using namespace std;
int main()
{
  unordered_map<int,int> mm;
  int n,x;  cin >> n >> x;
  while(n--){
    int a;  cin >> a;
    mm[a]++;
  } 
  long long ans = 0;
  for(auto & e : mm){
    ans = max(ans,(long long)e.first * min(e.second , x));
  }
  cout << ans << endl;
  return 0;
}
#include <iostream>
#include <queue>
using namespace std;
int main() {
	priority_queue<int,vector<int>,greater<int>> pq;

	int n, x;	cin >> n >> x;
	while (n--) {
		int a;	cin >> a;
		pq.push(a);
	}
	long long ans = 0,cnt = 0;
	while (!pq.empty()) {
		ans += max((long long)0, pq.top() - cnt * x);
		pq.pop();
		cnt++;
	}
	cout << ans << endl;
	return 0;



}


#include <iostream>
using namespace std;
using ll = long long;
void fun(){
  ll n = 0; cin >> n;
  if(n % 10 != 0){
    cout << n + 1 << endl;
    return;
  }
  ll cnt5 = 1,cnt2 = 1,tmp = n;
  while(tmp %2 == 0){
    tmp /= 2;
    cnt2 *= 2;
  }
  while(tmp % 5 == 0){
    tmp /= 5;
    cnt5 *= 5;
  }
  if(cnt2 > cnt5) cnt2 *= tmp;
  else cnt5 *= tmp;
  cout << cnt2 + cnt5 << endl;
  return;
}
// 120 --- 2 60 4 30 8 15
int main()
{
  int t;  cin >> t;
  while(t--){
    fun();
  }
  return 0;
}